Article 4319

Title of the article

CONDITIONS FOR THE CORRECT CALCULATION OF THE ENTROPY OF MEANINGFUL LONG PASSWORDS IN THE HAMMING CONVOLUTION SPACE WITH REFERENCE TEXTS IN RUSSIAN AND ENGLISH 

Authors

Volchikhin Vladimir Ivanovich, doctor of technical sciences, professor, President of Penza State University (40 Krasnaya street, Penza, Russia), E-mail: president@pnzgu.ru
Ivanov Aleksandr Ivanovich, doctor of technical sciences, professor, head of the laboratory, Penza Scientific Research Electrotechnical Institute (9 Sovetskaya street, Penza, Russia), E-mail: pniei@penza.ru
Karpov Artem Pavlovich, postgraduate student, Penza State University (40 Krasnaya street, Penza, Russia), E-mail: artem.karpei@mail.ru
Yunin Alexey Petrovich, specialist, Penza Scientific Research Electrotechnical Institute (9 Sovetskaya street, Penza, Russia), E-mail: pniei@penza.ru 

Index UDK

519.2, 004.622, 004.056.53 

DOI

10.21685/2307-5538-2019-3-4 

Abstract

Background. The aim of the work is to increase the correctness of calculating the entropy of long codes with dependent bits, which are meaningful easily remembered passwords in the user's native language.
Materials and methods. Since the classical Shannon procedures require the use of huge statistical material, they cannot be used in conditions of limited computing resources. To reduce the cost of computing resources, this paper uses code mapping in the normalized space of Hamming convolutions.
Results. The authors show that the results of computing the entropy of codes are more correct if one refuses bitwise addition modulo two when computing Hamming convolutions. In the article, it is suggested to use the data collapsing on module 8, since the encoding of passwords and reference texts are performed in 8-bit encoding. Moreover, the correct data conversion can be performed only by using a long password code that is collapsed with the reference text in the user's native language.
Conclusions. In the Hamming convolution space, it is easy to calculate the increase in the persistence of long, easy-to-remember passwords with meaning to brute-force attacks that arise from the periodic change of the long-password input register. 

Key words

the Entropy of long codes with dependent digits, regularization of calculations, a variety of Hamming convolutions, requirements for transcoding data before Hamming clipping 

Download PDF

 

Дата создания: 10.12.2019 14:27
Дата обновления: 11.12.2019 08:32